Metrics for Anonymity

نویسندگان

  • Rodolfo Leonardo Sumoza Matos
  • Ana Lucila Sandoval Orozco
  • Luis Javier Garćıa Villalba
  • Tai-hoon Kim
چکیده

This paper proposes the use of a system of measures for Anonymity based on the characteristics that define their main properties: the index of uniformity of the probability distribution and size of all anonymous. In previous proposals, the most widely used is based on the entropy, an index used in information theory, which has several drawbacks with respect to representation of the properties mentioned in the first place does not represent them explicitly and being a logarithmic index does not represent Anonymity levels or degrees that require linear behavior. To measure the uniformity index is proposed to use the Root Mean Square Error criterion or the Jensen-Shannon divergence. For anonymous set size proposes the use of a function of N.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anonymity Metrics Revisited

In 2001, two information theoretic anonymity metrics were proposed: the effective anonymity set size and the degree of anonymity. Here, we propose an abstract model for a general anonymity system which is consistent with the definition of anonymity on which the metrics are based. We revisit entropybased anonymity metrics, and we apply them to Crowds, a practical anonymity system. We discuss the...

متن کامل

On the Fundamentals of Anonymity Metrics

In recent years, a handful of anonymity metrics have been proposed that are either based on (i) the number participants in the given scenario, (ii) the probability distribution in an anonymous network regarding which participant is the sender / receiver, or (iii) a combination thereof. In this paper, we discuss elementary properties of metrics in general and anonymity metrics in particular, and...

متن کامل

An Improved Measure of Network Anonymity Using Profile Functions

We present a graphical framework containing certain infinite profiles of probability distributions that result from an attack on an anonymity system. We represent currently popular anonymity metrics within our framework to show that existing metrics base their decisions on just some small piece of information contained in a distribution. This explains the counterintuitive, thus unsatisfactory, ...

متن کامل

Anonymity and Privacy in Electronic Services

This thesis presents information theoretic anonymity metrics and various analysis of anonymous communication nodes. Our contributions are a step towards the understanding of anonymity properties and the development of robust anonymous communications. Anonymous communications are an essential building block for privacy-enhanced applications, as the data available at the communication layer may l...

متن کامل

Achieving Multidimensional K-Anonymity by a Greedy Approach

Protecting privacy in microdata publishing is K-Anonymity, Here recoding “models” have been considered for achieving k anonymity[1,2]. We proposes a new multidimensional model, which gives high flexibility. Often this flexibility leads to higher-quality anonymizations, as measured both by general-purpose metrics and more specific notions of query answerability. Like previous multidimensional mo...

متن کامل

Anonymity analysis in credentials-based systems: A formal framework

Anonymity has been formalized and some metrics have been defined in the scope of anonymizing communication channels. In this paper, such formalization has been extended to cope with anonymity in those scenarios where users must anonymously prove that they own certain privileges to perform remote transactions. In these types of scenarios, the authorization policy states the privileges required t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012